A note on arc-transitive circulant digraphs
نویسندگان
چکیده
We prove that, for a positive integer n and subgroup H of automorphisms of a cyclic group Z of order n, there is up to isomorphism a unique connected circulant digraph based on Z admitting an arc-transitive action of ZzH. We refine the Kovács–Li classification of arc-transitive circulants to determine those digraphs with automorphism group larger than ZzH. As an application we construct, for each prime power q, a digraph with q 1 vertices and automorphism group equal to the semilinear group GLð1; qÞ, thus proving that GLð1; qÞ is 2-closed in the sense of Wielandt.
منابع مشابه
Classifying Arc-Transitive Circulants
A circulant is a Cayley digraph over a finite cyclic group. The classification of arc-transitive circulants is shown. The result follows from earlier descriptions of Schur rings over cyclic groups.
متن کاملClassifying Arc-Transitive Circulants of Square-Free Order
A circulant is a Cayley graph of a cyclic group Arc transitive circulants of square free order are classi ed It is shown that an arc transitive circulant of square free order n is one of the following the lexicographic product Kb or the deleted lexicographic Kb b where n bm and is an arc transitive circulant or is a normal circulant that is Aut has a normal regular cyclic subgroup
متن کاملA Classification of 2-Arc-Transitive Circulants
A graph X is k-arc-transitive if its automorphism group acts transitively on the set of it-arcs of X. A circulant is a Cayley graph of a cyclic group. A classification of 2-arc-transitive circulants is given.
متن کاملPermutation Groups with a Cyclic Regular Subgroup and Arc Transitive Circulants
A description is given of finite permutation groups containing a cyclic regular subgroup. It is then applied to derive a classification of arc transitive circulants, completing the work dating from 1970’s. It is shown that a connected arc transitive circulant of order n is one of the following: a complete graph Kn , a lexicographic product [K̄b], a deleted lexicographic product [K̄b] − b , where ...
متن کاملHighly arc-transitive digraphs - Structure and counterexamples
Two problems of Cameron, Praeger, and Wormald [Infinite highly arc transitive digraphs and universal covering digraphs, Combinatorica (1993)] are resolved. First, locally finite highly arc-transitive digraphs with universal reachability relation are presented. Second, constructions of two-ended highly arc-transitive digraphs are provided, where each ‘building block’ is a finite bipartite digrap...
متن کامل